Edges of the Barvinok-Novik Orbitope
نویسنده
چکیده
Here we study the kth symmetric trigonometric moment curve and its convex hull, the Barvinok–Novik orbitope. In 2008, Barvinok and Novik introduced these objects and showed that there is some threshold so that for two points on S1 with arclength below this threshold the line segment between their lifts to the curve forms an edge on the Barvinok–Novik orbitope, and for points with arclength above this threshold their lifts do not form an edge. They also gave a lower bound for this threshold and conjectured that this bound is tight. Results of Smilansky prove tightness for k = 2. Here we prove this conjecture for all k.
منابع مشابه
Neighborliness of the Symmetric Moment Curve
in R, where t ranges over the unit circle S = R/2πZ. The curve Uk(t) is locally neighborly: as long as t1, . . . , tk lie in an open arc of S of a certain length φk > 0, the convex hull of the points Uk (t1) , . . . , Uk (tk) is a face of Bk. We characterize the maximum possible length φk, proving, in particular, that φk > π/2 for all k and that the limit of φk is π/2 as k grows. This allows us...
متن کاملA Centrally Symmetric Version of the Cyclic Polytope
We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes with n vertices of a given even dimension d = 2k when d is fixed and n grows. For a fixed even dimension d = 2k and an integer 1 ≤ j < k we prove that the maxi...
متن کاملOn testing Hamiltonicity of graphs
Let us fix a function f(n) = o(n lnn) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G with n vertices, decides either that one can add at most βn new edges to G so that G acquires a Hamiltonian circuit or that one cannot add αn or fewer new edges to G so that G acquires at least e−f(n)n! Hamiltonian circuits, or both.
متن کاملThe maximum k-colorable subgraph problem and orbitopes
Given an undirected node-weighted graph and a positiveinteger k, the maximum k-colorable subgraph problem is to select ak-colorable induced subgraph of largest weight. The natural integerprogramming formulation for this problem exhibits a high degree ofsymmetry which arises by permuting the color classes. It is well knownthat such symmetry has negative effects on the perform...
متن کاملExplicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets
We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3 ≈ (1.73) vertices and of centrally symmetric k-neighborly d-polytopes with about 2 2 2 k vertices. Using this result, we construct for a fixed k ≥ 2 and arbitrarily large d and N , a centrally symmetric d-polytope with N vertices that has at least ( 1− k · (γk) ) ( N k ) faces of dimension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 46 شماره
صفحات -
تاریخ انتشار 2011